Parsing as Deduction: The Use Knowledge of Language

نویسنده

  • Mark Johnson
چکیده

Hypothesising that the human parser is a specialized deductive device in which Universal Grammar and parameter settings are represented as axioms provides a model of how knowledge of language can be put to use. The approach is explained via a series of model deductive parsers for Government and Binding Theory, all of which use the same knowledge of language (i.e., underlying axiom system) but differ as to how they put this knowledge to use (i.e., they use different inference control strategies). They differ from most other GB parsers in that the axiom system directly reflects the modular structure of GB theory and makes fidl use of the multiple levels of reprepresentation posited in GB theory.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Bidirectional Model For Natural Language Processing

In this paper* I will argue for a model of grammatical processing that is based on uniform processing and knowledge sources. The main feature of this model is to view parsing and generation as two strongly interleaved tasks performed by a single parametrized deduction process. It will be shown that this view supports flexible and efficient natural language processing.

متن کامل

Parsing as Natural Deduction

The logic behind parsers for categorial grammars can be formalized in several different ways. Lambek Calculus (LC) constitutes an example for a natural deduction 1 style parsing method. In natural language processing, the task of a parser usually consists in finding derivations for all different readings of a sentence. The original Lambek Calculus, when it is used as a parser / theorem prover, ...

متن کامل

Parsing as Dynamic

In this chapter we develop a new approach to parsing through the re-cursive, model-theoretic interpretation of expressions representing linguistic knowledge. We argue that in particular the dynamic variant of model-theoretic semantics can be useful, which approaches interpretation in a constructive way. On the theoretical side, we develop this approach by integrating feature structures in an ex...

متن کامل

An improved joint model: POS tagging and dependency parsing

Dependency parsing is a way of syntactic parsing and a natural language that automatically analyzes the dependency structure of sentences, and the input for each sentence creates a dependency graph. Part-Of-Speech (POS) tagging is a prerequisite for dependency parsing. Generally, dependency parsers do the POS tagging task along with dependency parsing in a pipeline mode. Unfortunately, in pipel...

متن کامل

Parsing Natural Languages with CHR

In this paper, parsing as deduction and constraint programming are brought together to outline a procedure for the specification of constraint-based (chart) parsers. Extending the proposal in Shieber (1995) which provides a meta interpreter for several deduction systems, we show how to directly realize the inference rules for chart parsers as Constraint Handling Rules (Frühwirth, 1998) by viewi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005